Optimal Sequential Frame Synchronization for Fading Channel

نویسندگان

  • R. M. Sundaram
  • Devendra Jalihal
  • Venkatesh Ramaiyan
چکیده

In [1], Chandar et al studied a problem of sequential frame synchronization for a frame transmitted randomly and Uniformly in an interval of size A slots. For a discrete memoryless channel, they showed that the frame length N must scale as e > A for the frame detection error to go to zero (asymptotically with A). α(Q) is defined as the synchronization threshold for the discrete memory-less channel and depends on the channel transition probabilities Q. In our paper, we study the sequential frame synchronization problem for a fading channel and additive noise and seek to characterize the effect of fading. For a discrete ON-OFF fading channel (with ON probability p) and additive noise (with channel transition probabilities Qn), we characterise the synchronisation threshold of the composite channel α(Q) and show that α(Q) ≤ α(Qn)× p. We then characterize the synchronization threshold for Rayleigh fading and AWGN channel as a function of the fading and noise parameters. The asynchronous communication framework permits a tradeoff between sync frame length, N , and channel, Q, to support asynchronism. This allows us to characterize the synchronization threshold with sync frame energy for the wireless channel.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Secure Chaos-Based Communication Scheme in Multipath Fading Channels Using Particle Filtering

In recent years chaotic secure communication and chaos synchronization have received ever increasing attention. Unfortunately, despite the advantages of chaotic systems, Such as, noise-like correlation, easy hardware implementation, multitude of chaotic modes, flexible control of their dynamics, chaotic self-synchronization phenomena and potential communication confidence due to the very dynami...

متن کامل

Optimum frame synchronization for orthogonal FSK in flat fading channels and one burst application

We derive a maximum likelihood (ML) rule for one-shot frame synchronization of a random data burst with non-coherent orthogonal M-FSK signaling in a flat fading or AWGN channel. It uses a known frame synchronization pattern and, optionally, channel state information at the receiver. High SNR approximations are developed that are well suited for a low-cost implementation. A burst synchronizer st...

متن کامل

New frame synchronization technique for OFDM/OFDMA and MC-CDMA systems

In the context of orthogonal frequency division multiplexing (OFDM), most papers define OFDM symbol synchronization as frame synchronization. In this paper, a frame is defined as a block of several OFDM symbols in the time dimension. The main contribution of this work is to propose a novel, lowcomplexity, frame synchronization method for multi-carrier systems that does not require any transmiss...

متن کامل

A General Characterization of Sync Word for Asynchronous Communication

We study a problem of sequential frame synchronization for a frame transmitted uniformly in A slots. For a discrete memoryless channel (DMC), Chandar et al showed in [1] that the frame length N must scale with A as e > A for the frame synchronization error to go to zero (asymptotically with A). Here, Q denotes the transition probabilities of the DMC and α(Q), defined as the synchronization thre...

متن کامل

Frame Synchronization for Noncoherent Demodulation on Flat Fading Channels

Abstract – In this work we consider the problem of locating a known periodically embedded synchronization pattern in random data, which is subject to flat fading and additive white Gaussian noise. We derive the maximum likelihood rule and its high-SNR approximation for the case of noncoherent demodulation and show experimental results for the slow-fading Rayleigh channel. It is shown that the w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015